Refine your search
Collections
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Kumaravel, A.
- Web Portal Visits Patterns Predicted by Intuitionistic Fuzzy Approach
Abstract Views :428 |
PDF Views:0
Authors
Affiliations
1 School of Computing, Bharath University, Selaiyur, Chennai-600073, IN
2 School of Computing Sciences, Bharath University, Selaiyur, Chennai-600073, IN
1 School of Computing, Bharath University, Selaiyur, Chennai-600073, IN
2 School of Computing Sciences, Bharath University, Selaiyur, Chennai-600073, IN
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4549-4553Abstract
Web mining is applied to reflect the importance of webpages and to predict the web domain visits of various users. An IF-inference system is developed for this purpose. This paper presents basic notions of web mining with fuzzy inference systems based on the Takagi-Sugeno fuzzy model. At first, it scans the sequences of visits in database once, finds all the weighted frequent items, and produces a sparse matrix for that sequence item set from which basic statistics like moving averages and exponentially smoothing averages are calculated. Then we construct a IF-inference system using intuitionistic approach for predicting the web domain visits. We obtain the results of such system.Keywords
Web Mining, If-inference System, Web Domain Visits, Fuzzy Logic, Prediction, Sparse Matrix, Moving Averages, Exponential SmoothingReferences
- Cooley R, Mobasher B et al. (1997). Web mining: information and pattern discovery on the world wide web, Proceedings of the 9th IEEE International Conference on Tools With Artificial Intelligence, (ICTAI ’97), Newport Beach, CA.
- Zaine O, and Han J (1998). WebML: Querying the world wide web for resources and knowledge, Proceedings of the International workshop on web information and data management, WIDM´98, Bethesda.
- Kuncheva L I (2000). Fuzzy classifier design, A Springer Verlag Company, Germany.
- Bandemer H, and Gottwald S (1995). Fuzzy sets fuzzy logic, fuzzy methods, John Wiley and Sons Inc., New York.
- Olej V (2003). Modeling of economics processes by computational intelligence, Hradec Kralove, (in Slovak).
- Trešl J (1999). Statistical methods and capital market, 1st edition, Prague, (in Czech).
- Montiel O et al. (2008). Mediative fuzzy logic: A new approach for contradictory knowledge management, Soft Computing, vol 20, No.3, 251–256.
- Guillaume S (2001). Designing fuzzy inference systems from Data: An Interpretability-oriented review, IEEE Transactions on Fuzzy Systems, vol 9, 426–442.
- Available From: http://www.wseas.us/e-library/transactions/computers/2010/88-321.pdf
- Fuzzy Logic Toolbox™ User’s Guide© Copyright 1995–2012, The Math Works, Inc.
- Available From: http://archive.ics.uci.edu/ml/datasets/MSNBC.com+Anonymous+Web+Data.
- Availbale From: http://www.mathworks.in/help/matlab/ref/ sparse.html
- Kumaravel A, and Pradeepa R (2012). On constructing regular expression of web page traversals for efficient filtering, IEEE Conference Publications, 156-160.
- Algorithm for Automaton Specification for Exploring Dynamic Labyrinths
Abstract Views :461 |
PDF Views:0
Authors
Affiliations
1 School of Computing, Bharath University, Chennai-600073
2 Dept of Computer Applications Bharath University, Chennai-600073
1 School of Computing, Bharath University, Chennai-600073
2 Dept of Computer Applications Bharath University, Chennai-600073
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4554-4559Abstract
A variety of interesting problems arise in the study of finite automata that move about in a two dimensional space. The model proposed by Muller [4] is used here to construct new automaton which can explore any labyrinth and escape through the moving or dynamic obstacles inside over the grid. The earlier results were shown for static obstacles distributed over integer grid and the automaton in this case was constructed to interact on the rectangular grid location endowed with four neighborhood directional states. In this paper we allow obstacles moving in discrete steps and verify that the finite automaton with just five printing symbols can escape or find the exit.Keywords
Labyrinths, Finite State Automaton, Printing Mouse, Free Way of EscapeReferences
- Active-Robots (n.d.) (2008). Cruiser Maze Solver Robot. Available from: http://www.microrobot.co.kr, http://www.activerobots.com/products/robots/cruiser-details-2.shtml.
- Bruggemann B (2006). Entkommen aus unbekannten labyrinthen mit einbahnstrassen, Master’s thesis, Rheinische Friedrich Wilhelms Universität Bonn.
- Bruggemann B, Kamphans T et al. (2007). Leaving an unknown maze with one-way roads, in Abstracts 23nd European Workshop Computational Geometry, Graz, Austria, 90–93.
- Muller H (1977). A one symbol printing automation escaping from every labyrinth, Computing Springer Verlag, vol 19, 95–110.
- Muller H (1971). Endliche automaten und labyrinthen, Elecktronishe Informations verarbeitung und Kybernetik, vol 7(4), 261–264.
- Muller H (1971). Stack automaten in labyrinthen, Archiv Für Mathematische Logik Und Grundlagenforschung, vol 14 (3-4), 127–134.
- Nolfi S, and Floreano D (2000). Evolutionary robotics: the biology, intelligence, and technology of self-organizing machines (Intelligent Robotics and Autonomous Agents), Bradford Books.
- An Application of Non-uniform Cellular Automata for Efficient Cryptography
Abstract Views :637 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science & Engineering Bharath University, Chennai
1 Department of Computer Science & Engineering Bharath University, Chennai
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4560-4566Abstract
One of the core issues for robust cryptographic systems is to deal with the rate of diffusion and distribution of keys. We try to strengthen this aspect by increasing the length of block ciphers. We present a new encryption and decryption algorithm for block cipher that supports 27 bit block size. All components in our system are chosen to be based on cellular automata so as to achieve higher parallelism and to simplify the in hardware and software implementation for applications with high degree of security. The main objective of this paper is to increase the complexity by novel schemes of mixing (reversible cellular automata) RCA and (non-uniform reversible cellular automata) NRCA. We apply set of different bit permutation methods for this purpose .This paper establishes the proof for existence of yet another approach for a high quality pseudorandom bit sequences generated by non uniform cellular automata.Keywords
Cryptographic System, NRCA-non Reversible CA, Pseudorandom Number, RCA-reversible Cellular AutomataReferences
- Schneier B (1996). Applied cryptography, Wiley, New York.
- Tripathy S, and Nandi S (2009). LCASE: Lightweight Cellular Lightweight Cellular Automata-based Symmetric-key Encryption, International Journal of Network Security, vol 8(2), 243–252.
- Sarkar P (2000). A brief history of cellular automata, Journal of ACM Computing Surveys (CSUR), vol 32(1), 80–107.
- Wolfram S (1986). Cryptography with cellular automata, Crypto ‘85, LNCS 218, Springer-verlag, 429–432.
- Wolfram S (1986). Random sequence generation by cellular automata, Advances in Applied Mathematics, vol 7(2), 123–169.
- Seredynski F, Bouvry P et al. (2004). Cellular automata computations and secret key cryptography, Parallel Computing Journal, vol 30(5-6), 753–766.
- Standaert F, Piret G et al. (2004). ICEBERG : An involutional cipher efficient for block encryption in reconfigurable hard- ware, FSE ‘04, LNCS 3017, Springer- verlag, 279–299.
- Sklavos N, Moldovyan N A et al. (2005). High speed networking security: Design and implementation of two new DDP-based ciphers, Mobile Networks and Applications-MONET, vol 25(1-2), 219–231.
- Moldovyan N A, Moldovyan P A et al. (2007). On software implementation of fast DDP-based ciphers, International Journal of Network Security, vol 4(1), 81–89.
- Toffoli T, and Margolus N (2001). Invertible cellular automata: A review, Physica D, vol 45(1–3), 229–253, (Reprinted with correction as of Oct).
- Layered Approach for Predicting Protein Subcellular Localization in Yeast Microarray Data
Abstract Views :482 |
PDF Views:0
Authors
A. Kumaravel
1,
R. Pradeepa
2
Affiliations
1 Department of Computer Science and Engineering, Bharath University, Selaiyur, Chennai-600073, IN
2 Department of Computer Science and Engineering, Bharath University, Selaiyur, Chennai - 600073
1 Department of Computer Science and Engineering, Bharath University, Selaiyur, Chennai-600073, IN
2 Department of Computer Science and Engineering, Bharath University, Selaiyur, Chennai - 600073
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4567-4571Abstract
Subcellular localization is a well-designed representation of proteins. We need a fully automatic and reliable prediction system for protein subcellular localization, especially for the analysis of large-scale of yeast microarray data. In this paper we consider the dataset with multi classes and propose the classification for each location of protein subcellular in a separate layer. In this work, a multi-classification approach for subcellular localization is designed and developed to achieve high efficiency and improve the prediction and classification accuracy. The rule based Ripper method has been found to predict the subcellular localization of proteins from their protein microarray data, compared to other classifiers.Keywords
Data Mining, Microarray, Classification, Layered Approach, Protein Subcellular LocalizationReferences
- Hua S, and Sun Z (2001). Support vector machine approach for protein subcellular localization prediction, Bioinformatics, vol 17(8), 721–728, Available From: http://bioinformatics.oxfordjournals.org/
- Available From: http://videocast.nih.gov/pdf/rm/Snyder.pdf
- Gifty P, and Ravichandran J M et al. (2012). Efficient classifier for R2L and U2R attacks, International Journal of Computer Applications, vol 45, No. 21, 0975–8887.
- Kumaravel A, and Niraisha M (2013). Multi-classification approach for detecting network attacks ICT545, 2013-IEEE Conference on Information and Communication Technologies.
- Available From: Weka: http://www.cs.waikato.ac.nz/~ml/weka/
- Protein localization dataset from Institute of Molecular and Cellular Biology Osaka, University, Available From: http://www.imcb.osaka-u.ac.jp/nakai/psort.html
- Gaur A, and Richariya V (2011). A layered approach for intrusion detection using meta-modeling with classification techniques, International Journal of Computer Technology and Electronics Engineering (IJCTEE), vol 1(2), 161–168.
- Kumaravel A, and Pradeepa R (2013). Efficient molecule reduction for drug design by intelligent search methods, International Journal of Pharama and Bio Sciences, vol 4(2): (B), 1023–1029, Available From: http://www.ijpbs.net/cms/php/upload/2348_pdf.pdf
- Available From: http://webdocs.cs.ualberta.ca/~eisner/measures.html
- Introducing an Efficient Programming Paradigm for Object-oriented Distributed Systems
Abstract Views :372 |
PDF Views:0
Authors
Affiliations
1 Department of Information Technology, Bharath University, Chennai-600073
2 School of Computing, Bharath University, Chennai-73, IN
1 Department of Information Technology, Bharath University, Chennai-600073
2 School of Computing, Bharath University, Chennai-73, IN
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4596-4603Abstract
Implementing a distributed process using object oriented programming is challenging especially for clusters of nodes ensuring the availability. Java happens to be well suited for writing object oriented programs for applications which needs modularity and high degree of cohesion [2]. In this paper our objective is to propose appropriate programming paradigms for loosely coupled distributed and object-oriented systems with a specific focus on parallel programming and client-server object computing. We select a prototype tool made based on the research outcome as found in [1] for this purpose. This research prototype tool 'Vishwa' provides a very good starting point for graduate students, engineers and scientists in academia, industry and government to present their tasks using the aspects of parallel and distributed computing. The learning curve is shorter in the domain of grid due to the simplicity in deploying and processing with this tool. We also demonstrate with a case study for bringing out the easiness in splitting the given job into subtasks and executed in this type of grid environment.Keywords
Grid Computing, Distributed Computing, Object Oriented Programming, Speedup Ratio, MiddlewareReferences
- Janakiram D (2010). Grid Computing, Research Monograph Tata Mcgraw-Hill Publishers.
- Srinivas V, and Janakiram D (2009). Node capability aware replica management for peer-to-peer grids, IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans, vol 39, No. 4, 807–818.
- Berman F, Fox G et al. (2003). Grid computing: making the global infrastructure a reality, 1st Edn., Wiley Series.
- Joseph, Joshy, and Fellenstein Craig (2003). Grid Computing, Prentice Hall PTR.
- Joseph J, Ernest M et al. (2004). Evolution of grid computing architecture and grid adoption models, IBM Systems Journal, vol 43(4), 624–645.
- Baker M, Apon A et al. (2005). Emerging Grid Standards, IEEE Computer, vol 38(4), 43–50.
- Eddy Carona et al. (2007). Definition, modeling and simulation of a grid computing scheduling system for high throughput computing, Future Generation Computer Systems, vol 23(8), 968–976.
- Parashar M, and Browne J C (2005). Conceptual and Implementation Models for the Grid, Proceedings of the IEEE, vol 93(3), 653–668.
- Atiknson M, Chervenal A et al. (2004). Data Access, Integration and Management, The Grid: Blueprint for a New Computing Infrastructure, Morgan Kauffmann.
- Chawathe Y, Ratnasamy S et al. (2003). Making Gnutella-like P2P Systems Scalable, SIGCOMM’03, Available From: http://dcg.ethz.ch/lectures/ws0506/seminar/papers/scalable_p2p.pdf
- Rowstron A, and Druschel P (2001). Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 329–350.
- Survey on Fuzzy Petri Nets for Classification
Abstract Views :246 |
PDF Views:0
Authors
S. Meher Taj
1,
A. Kumaravel
2
Affiliations
1 Department of Mathematics, AMET University, Chennai - 603112, Tamil Nadu, IN
2 School of Computing, Bharath University, Chennai - 600073, Tamil Nadu, IN
1 Department of Mathematics, AMET University, Chennai - 603112, Tamil Nadu, IN
2 School of Computing, Bharath University, Chennai - 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 14 (2015), Pagination:Abstract
The aim of this study is based on Survey on fuzzy Petri nets for Classification. Petri Nets (PN) is excellent networks which have great characteristics of combining a well defined mathematical theory with a graphical representation of the dynamic behavior of systems. But, with the growth in the difficulty of modern industrial, and communication systems, PN found themselves inadequate to address the problems of vagueness, and imprecision in data. This gave rise to combination of Fuzzy logic with Petri nets and a new tool emerged with the name of Fuzzy Petri Nets (FPN). Much research has been done for FPN and a number of their applications have been expected, but their basic types and structure is still ambiguous. Result of this research, an effort is made to categorize the applications of FPN for classification according to their structure and algorithms. We identify the different types of Petri nets will improve future research on Petri nets. Hence in this study, due to these limitations we focus on establishing the FPN in the light of their classifications has been done.Keywords
Discrete Event Systems, Fuzzy Logic, Fuzzy Petri Nets, Petri Nets- Data Mining of Social Media Specific Strings for Rapid Forensic Investigation
Abstract Views :217 |
PDF Views:0
Authors
A. Vinu
1,
A. Kumaravel
2
Affiliations
1 Department of Information Technology, Jerusalem College of Engineering, Chennai - 600100, Tamil Nadu, IN
2 Department of Information Technology, Bharath University, Chennai - 600073, Tamil Nadu, IN
1 Department of Information Technology, Jerusalem College of Engineering, Chennai - 600100, Tamil Nadu, IN
2 Department of Information Technology, Bharath University, Chennai - 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 32 (2015), Pagination:Abstract
Instant Messengers become an important means of communication. Millions of people. regardless of age, nationality, gender and computer skills, spend a lot of time using them every day. Thus, Social networks already occupied the place of traditional messaging systems of the past. More and more communications are migrating from public chat rooms and private messengers into online Social Networking Sites (SNSs). As cybercrimes mushroom in recent years, more and more digital crime investigations have strong relations to these SNSs. Communications extracted from SNSs can be extremely valuable and useful to all kinds of investigators including forensic investigators. We now apply the spotlight on distinct strings specific to each SNSs and volatile memory analysis and display of any case detail as a key to a successful digital investigation through rapid & improved retrieval performance.Keywords
Digital Evidence, Distinct String Analysis, Forensic Investigators, Instant Messengers, Volatile Memory Analysis- Theoretical Analysis of Trust-based Routing Schemes for Wireless Sensor Networks
Abstract Views :214 |
PDF Views:0
Authors
X. Anita
1,
A. Kumaravel
2
Affiliations
1 Department of Information Technology,Jerusalem College of Engineering, Chennai - 600100, Tamil Nadu, IN
2 Department of Information Technology, Bharath University, Chennai - 600073, Tamil Nadu, IN
1 Department of Information Technology,Jerusalem College of Engineering, Chennai - 600100, Tamil Nadu, IN
2 Department of Information Technology, Bharath University, Chennai - 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 32 (2015), Pagination:Abstract
WSNs comprises of densely deployed tiny sensor devices deployed in sensitive applications. The security systems designed does not consider the constraints of sensor nodes. Trust of the network depends on packet forwarding behavior of the neighbor. The communication overhead depends on the number of packets transmitted for trust computation. The memory consumption depends on the size of the trust tables used for trust computation. In this paper, we have presented the communication overhead and memory consumption of the existing trust based routing schemes.- A Novel Approach to Trust based Identification of Leaders in Social Networks
Abstract Views :211 |
PDF Views:0
Authors
Pallab Dutta
1,
A. Kumaravel
2
Affiliations
1 Department of CSE, Bharath University, Chennai - 600073, Tamil Nadu, IN
2 School of Computing, Bharath University, Chennai - 600073, Tamil Nadu, IN
1 Department of CSE, Bharath University, Chennai - 600073, Tamil Nadu, IN
2 School of Computing, Bharath University, Chennai - 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 10 (2016), Pagination:Abstract
Recommender Systems has been a research hotspot in recent times as an efficient information filtering tool, to filter out useful required information from ever expanding web. The characteristics of social networks play a very important role towards behavioralmodeling of a trust network based Recommender System (RS). Similar to real world, in a social network also, it is important to objectively identify a member with high reputation who is heavily trusted by many members and hence his suggestions and inputs are most trust worthy for the whole community; that is, objective identification of leader is extremely important. In this paper, we propose a method to objectively identify leaders in a social network, we introduce new terms: Leadership score, prominence trust, peer inclusive factor, trust spread factor, trust maturity factor and trust penetration factors to portray a member more appropriately in a social network. We have calculated the leadership score using the real world dataset. Leadership score is taken as a linear additive function of prominence trust, engagement trust and peer inclusive factors with different weightage values. In our experiment, we have considered that leaders not only are followed by others, they are also socially engaged from their end to others in the social network. Prominence trust is a detailed characterization to get more accurate value of trust. Along with overall trust score, it is imperative to analyze more attributes to derive a more objective interpretation of the same. These attributes take care of trust score/reputation over period of time, number of trusting members, peer level interactions and also absolute score. To validate our leadership model in social network, we remove top 5%, 10% and top 20% of the members with high ‘leadership score’ and findout the reduction in the overall interactions. As further improvements to this work, a social network to be built with users and items and collect the data using positive and negative responses; use multiprogramming concepts to determine the optimum function for leadership score. This will aid towards further analysis and fine tuning of the models.Keywords
Data Mining, Recommender System, Social Network, Trust, Web Mining- Cellular Automata Construction for Novel Routing over Hexagonal Grid for Mobile Ad-hoc Networks
Abstract Views :164 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science, Bharath University, Chennai - 600073, Tamil Nadu, IN
1 Department of Computer Science, Bharath University, Chennai - 600073, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 31 (2015), Pagination:Abstract
We address the problem of constructing an efficient route algorithm for Mobile Ad-hoc Network setting up QoS routes based on route discovery mechanism of AODV protocol and cellular automata. A Mobile Ad-hoc Network (MANET) consists of mobile nodes which are free to move arbitrarily due to its dynamic nature, adaptive and infrastructure less in nature. It is very tough task to have a snap of a network topology in this dynamic nature. Many research works have done to find a shortest path in MANET, it may give a better solution for finding an optimal path but difficult to augment with QoS constraints and its energy utilization. Here we have proposed an algorithm based on hexagonal cellular automata model for giving an efficient algorithm. This algorithm applies ADOV protocol and Lee's algorithm for constructing a shortest route and it considers energy and delay/bandwidth constraints as its basic metrics. These two metrics give a basic criterion for selecting a path between source and destination nodes through hexagonal cellular automata. Finally it is modeled with a matrix to implement it.Keywords
ADOV, Cellular Automata, Hexagonal Grids, Lee Algorithm, Mobile Ad-hoc Networks, Quality of Service.- Detection of Malicious Attacks by Meta Classification Algorithms
Abstract Views :113 |
PDF Views:2
Authors
Affiliations
1 Department of Computer Science and Engineering, Bharath University, Chennai, IN
2 School of Computing, Bharath University, Chennai, IN
3 St.Joseph College of Engineering, Chennai, IN
1 Department of Computer Science and Engineering, Bharath University, Chennai, IN
2 School of Computing, Bharath University, Chennai, IN
3 St.Joseph College of Engineering, Chennai, IN
Source
International Journal of Advanced Networking and Applications, Vol 6, No 5 (2015), Pagination: 2455-2459Abstract
We address the problem of malicious node detection in a network based on the characteristics in the behavior of the network. This issue brings out a challenging set of research papers in the recent contributing a critical component to secure the network. This type of work evolves with many changes in the solution strategies. In this work, we propose carefully the learning models with cautious selection of attributes, selection of parameter thresholds and number of iterations. In this research, appropriate approach to evaluate the performance of a set of meta classifier algorithms (Ad Boost, Attribute selected classifier, Bagging, Classification via Regression, Filtered classifier, logit Boost, multiclass classifier). The ratio between training and testing data is made such way that compatibility of data patterns in both the sets are same. Hence we consider a set of supervised machine learning schemes with meta classifiers were applied on the selected dataset to predict the attack risk of the network environment. The trained models were then used for predicting the risk of the attacks in a web server environment or by any network administrator or any Security Experts. The Prediction Accuracy of the Classifiers was evaluated using 10-fold Cross Validation and the results have been compared to obtain the accuracy.Keywords
Meta Classifier, Data Mining, Decision Trees, Decision Rules, Malicious Detection, KDD Dataset, Machine Learning, Network Security.- Features Subset Selection using Improved Teaching Learning based Optimisation (ITLBO) Algorithms for Iris Recognition
Abstract Views :201 |
PDF Views:0
Authors
Affiliations
1 Depatment of CSE, Bharath University, Chennai – 600073, Tamil Nadu, IN
2 Depatment of CSE, Dhanalakshmi engineering College, Chennai – 601301, Tamil Nadu, IN
1 Depatment of CSE, Bharath University, Chennai – 600073, Tamil Nadu, IN
2 Depatment of CSE, Dhanalakshmi engineering College, Chennai – 601301, Tamil Nadu, IN